Parallel strong orientation of an undirected graph

Parallel Strong Orientation of an Undirected Graph

Structural controllability: an undirected graph approach

This paper addresses questions regarding controllability for ‘generic parameter’ dynamical systems, i.e. the question whether a dynamical system is ‘structurally controllable’. Unlike conventional methods that deal with structural controllability, our approach uses an undirected graph: the behavioral approach to modelling dynamical systems allows this. Given a system of linear, constant coeffic...

Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel

ÐLet G be an undirected graph and T be a spanning tree of G. In this paper, an efficient parallel algorithm is proposed for determining whether T is an unordered depth-first search tree of G. The proposed algorithm runs in O…m=p‡ logm† time using p processors on the EREW PRAM, where m is the number of edges contained in G. It is cost-optimal and achieves linear speedup. Index TermsÐDepth-first ...

On finding an ear decomposition of an undirected graph distributively

An ear decomposition of a connected undirected graph G= (V ,E) is a partition of the edge (link) set E into a collection of edge-disjoint paths P0,P1, . . . ,P|E|−|V |+1, called ears, such that P0 is a link, P0 ∪P1 is a closed path (i.e., a cycle), and for each i , 2 i |E| − |V | + 1, Pi is a path of which each terminating node belongs to some Pj , j < i , and no internal node belongs to any Pj...

Propagation of 2-Monotone Lower Probabilities on an Undirected Graph

Lower and upper probabilities, also known as Choquet capacities, are widely used as a con­ venient representation for sets of probability distributions. This paper presents a graphi­ cal decomposition and exact propagation al­ gorithm for computing marginal posteriors of 2-monotone lower probabilities (equivalently, 2-alternating upper probabilities).